Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
نویسندگان
چکیده
منابع مشابه
Domain Decomposition Preconditioners for Higher-Order Discontinuous Galerkin Discretizations
Aerodynamic flows involve features with a wide range of spatial and temporal scales which need to be resolved in order to accurately predict desired engineering quantities. While computational fluid dynamics (CFD) has advanced considerably in the past 30 years, the desire to perform more complex, higher-fidelity simulations remains. Present day CFD simulations are limited by the lack of an effi...
متن کاملLow Rank Tensor Methods in Galerkin-based Isogeometric Analysis
The global (patch-wise) geometry map, which describes the computational domain, is a new feature in isogeometric analysis. This map has a global tensor structure, inherited from the parametric spline geometry representation. The use of this global structure in the discretization of partial differential equations may be regarded as a drawback at first glance, as opposed to the purely local natur...
متن کاملWeighted tensor decomposition for approximate decoupling of multivariate polynomials
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor methods are known, but these have only been studied in the exact case. In this paper, we generalize an existing method to the noisy case, by introducing a weight ...
متن کاملMultipatch Discontinuous Galerkin Isogeometric Analysis
Isogeometric analysis (IgA) uses the same class of basis functions for both, representing the geometry of the computational domain and approximating the solution. In practical applications, geometrical patches are used in order to get flexibility in the geometrical representation. This multi-patch representation corresponds to a decomposition of the computational domain into non-overlapping sub...
متن کاملBlock-Decoupling Multivariate Polynomials Using the Tensor Block-Term Decomposition
We present a tensor-based method to decompose a given set of multivariate functions into linear combinations of a set of multivariate functions of linear forms of the input variables. The method proceeds by forming a three-way array (tensor) by stacking Jacobian matrix evaluations of the function behind each other. It is shown that a blockterm decomposition of this tensor provides the necessary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2018
ISSN: 0045-7825
DOI: 10.1016/j.cma.2018.03.026